Multiplayer Games and their Need for Scalable and Secure State Management
نویسنده
چکیده
In recent years, massively multiplayer online games (MMOGs) have become very popular by providing more entertainment, therefore millions of players now participate may interact with each other in a shared environment, even though these players may be separated by huge geographic distances. Peer to Peer (P2P) architectures become very popular in MMOG recently, due to their distributed and collaborative nature, have low infrastructure costs, achieve fast response times by creating direct connections between players and can achieve high scalability. However, P2P architectures face many challenges and tend to be vulnerable to cheating. Game distribution between peers makes maintaining control of the game becomes more complicated. Therefore, broadcasting all state changes to every player is not a viable solution to maintain a consistent game state in a MMOGs. To successfully overcome the challenge of scale, MMOGs have to employ sophisticated interest management techniques that only send relevant state changes to each player. In this paper, In order to prevent cheaters to gain unfair advantages in P2P-based MMOGs, several cheat-proof schemes have been proposed that utilize a range of techniques such as cryptographic mechanisms, Commitment and agreement protocols, and proxy architecture.
منابع مشابه
Scalable and Secure Architectures for Online Multiplayer Games
Networked games have rapidly evoved from small 4-8 person, one-time play games to large-scale persistent games involving thousands of participants. However, most of these games have centralized client-server architectures which create significant robustness and scalability bottlenecks. This thesis proposes a new modular distributed architecture for interactive multiplayer games. This architectu...
متن کاملSubgame Perfection for Equilibria in Quantitative Reachability Games
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...
متن کاملOn (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...
متن کاملAuthorization models for secure information sharing: a survey and research agenda
This article presents a survey of authorization models and considers their 'fitness-for-purpose' in facilitating information sharing. Network-supported information sharing is an important technical capability that underpins collaboration in support of dynamic and unpredictable activities such as emergency response, national security, infrastructure protection, supply chain integration and emerg...
متن کاملObject-Oriented Network Middleware for Massively Multiplayer Online Games
In this paper we present a scalable networking middleware designed for multiplayer and massively multiplayer games. We argue that objects can implement an ideal interface between the game logic and the communication middleware. This allows the game developer to maintain current design techniques and apply object-oriented decomposition to partition the game state. Game objects are mapped to dupl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1505.01864 شماره
صفحات -
تاریخ انتشار 2015